A New Delay-Constrained Multicast Routing Algorithm Based on Shared Edges
نویسندگان
چکیده
منابع مشابه
A New Delay-Constrained Multicast Routing Algorithm Based on Shared Edges
In this paper, we made a detail analysis for the ESAMPH algorithm, and proposed ESAMPH_D algorithm according to the insufficient of ESAMPH algorithm. The ESAMPH_D algorithm does not consider those paths that do not satisfy the delay constraint, so we can ensure that all paths be taken into account will meet the limit of delay constraint, then we find the least costly path in order to build a mi...
متن کاملDelay-Constrained Multicast Routing Algorithm Based on Average Distance Heuristic
Multicast is the ability of a communication network to accept a single message from an application and to deliver copies of the message to multiple recipients at different location. With the development of Internet, Multicast is widely applied in all kinds of multimedia real-time application: distributed multimedia systems, collaborative computing, video-conferencing, distance education, etc. I...
متن کاملMAMCRA: a constrained-based multicast routing algorithm
Multicast routing algorithms that are capable of providing quality of service (QoS) to its members will play an important role in future communications networks. This paper discusses some fundamental properties of multicast routing subject to multiple QoS requirements. We will show that guaranteeing QoS and optimizing resource utilization are conflicting objectives and require a trade-off. We a...
متن کاملDelay-Constrained Shared Multicast Trees
We study the problem of constructing delay-constrained shared multicast trees for realtime applications in connection-oriented high-speed networks. We formulate the problem as a diameter-constrained minimum Steiner tree problem, and prove that it is NP-complete. Then we propose distributed, dynamic heuristics for solving this problem. Most previous work on shared multicast trees starts by selec...
متن کاملA Distributed Delay-Constrained Dynamic Multicast Routing Algorithm
Many new distributed multimedia applications involve dynamic multiple participants, have stringent end-to-end delay requirement and consume large amount of network resources. In this paper, we propose a distributed delay-constrained dynamic multicast routing algorithm (DCDMR) to support these applications. DCDMR scales well because the source of the multicast tree needs only limited computation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications and Network
سال: 2014
ISSN: 1949-2421,1947-3826
DOI: 10.4236/cn.2014.61006